#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pdd pair<double, double>
#define pii pair<int,int>
#define endl '\n'
const int INF = 1e9+10;
const int MOD = 1e9+7;
using namespace std;
// -----------------------------------------------------------------------------------------------
int a[200005];
pii v[5000005];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i];
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
int tot = a[i]+a[j];
pii brr = {0LL,0LL};
if(v[tot] == brr){
v[tot] = {i,j};
}
else{
if(v[tot].fi == i || v[tot].se == i){
continue;
}
else if(v[tot].fi == j || v[tot].se == j){
continue;
}
else{
cout << "YES" << endl;
cout << v[tot].fi << " " << v[tot].se << " " << i << " " << j << endl;
return 0;
}
}
}
}
cout << "NO" << endl;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |